Bridge-Depth Characterizes which Minor-Closed Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel

نویسندگان

چکیده

We study the kernelization complexity of structural parameterizations Vertex Cover problem. Here, goal is to find a polynomial-time preprocessing algorithm that can reduce any instance $(G,k)$ problem an equivalent one, whose size polynomial in pre-determined parameter $G$. A long line previous research deals with based on number vertex deletions needed $G$ member simple graph class $\mathcal{F}$, such as forests, graphs bounded tree-depth, and maximum degree two. set out most general classes $\mathcal{F}$ for which parameterized by vertex-deletion distance input admits kernelization. give complete characterization minor-closed families exists. introduce new called bridge-depth, prove exists if only has bridge-depth. The proof interesting connection between bridge-depth minimal blocking sets graphs, are removal decreases independence number.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The vertex-cover polynomial of a graph

In this paper we de1ne the vertex-cover polynomial (G; ) for a graph G. The coe2cient of r in this polynomial is the number of vertex covers V ′ of G with |V ′|= r. We develop a method to calculate (G; ). Motivated by a problem in biological systematics, we also consider the mappings f from {1; 2; : : : ; m} into the vertex set V (G) of a graph G, subject to f−1(x) ∪ f−1(y) = ∅ for every edge x...

متن کامل

Structural Parameterizations of Feedback Vertex Set

A feedback vertex set in an undirected graph is a subset of vertices whose removal results in an acyclic graph. It is well-known that the problem of finding a minimum sized (or k-sized in case of decision version of) feedback vertex set (FVS) is polynomial time solvable in (sub)-cubic graphs, in pseudo-forests (graphs where each component has at most one cycle) and mock-forests (graphs where ea...

متن کامل

Kernels for Structural Parameterizations of Vertex Cover - Case of Small Degree Modulators

Vertex Cover is one of the most well studied problems in the realm of parameterized algorithms and admits a kernel with O(`2) edges and 2` vertices. Here, ` denotes the size of a vertex cover we are seeking for. A natural question is whether Vertex Cover admits a polynomial kernel (or a parameterized algorithm) with respect to a parameter k, that is, provably smaller than the size of the vertex...

متن کامل

Kernel Bounds for Structural Parameterizations of Pathwidth

Assuming the AND-distillation conjecture, the Pathwidth problem of determining whether a given graphG has pathwidth at most k admits no polynomial kernelization with respect to k. The present work studies the existence of polynomial kernels for Pathwidth with respect to other, structural, parameters. Our main result is that, unless NP ⊆ coNP/poly, Pathwidth admits no polynomial kernelization ev...

متن کامل

On Weights Which Admit the Reproducing Kernel of Bergman Type

In this paper we consider (1) the weights of integration for which the reproducing kernel of the Bergman type can be defined, i.e., the admissible weights, and (2) the kernels defined by such weights. It is verified that the weighted Bergman kernel has the analogous properties as the classical one. We prove several sufficient conditions and necessary and sufficient conditions for a weight to be...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SIAM Journal on Discrete Mathematics

سال: 2022

ISSN: ['1095-7146', '0895-4801']

DOI: https://doi.org/10.1137/21m1400766